Sequential Change-Point Detection via Online Convex Optimization
نویسندگان
چکیده
منابع مشابه
Sequential Change-Point Detection via Online Convex Optimization
Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential likelihood ratios with non-anticipating estimators constructed using online convex optimization algorithms such as online mirror descent, which provid...
متن کاملon the bayesian sequential change-point detection
the problems of sequential change-point have several important applications in quality control, signal processing, and failure detection in industry and finance. we discuss a bayesian approach in the context of statistical process control: at an unknown time $tau$, the process behavior changes and the distribution of the data changes from p0 to p1. two cases are considered: (i) p0 and p1 are fu...
متن کاملA sequential multiple change-point detection procedure via VIF regression
In this paper, we propose a procedure for detecting multiple change-points in a mean-shift model, where the number of change-points is allowed to increase with the sample size. A theoretic justification for our new method is also given. We first convert the change-point problem into a variable selection problem by partitioning the data sequence into several segments. Then, we apply a modified v...
متن کاملOn Sequential Hypotheses Testing via Convex Optimization
We propose a new approach to sequential testing which is an adaptive (on-line) extension of the (off-line) framework developed in [1]. It relies upon testing of pairs of hypotheses in the case where each hypothesis states that the vector of parameters underlying the distribution of observations belongs to a convex set. The nearly optimal under appropriate conditions test is yielded by a solutio...
متن کاملAccelerating Online Convex Optimization via Adaptive Prediction
We present a powerful general framework for designing data-dependent online convex optimization algorithms, building upon and unifying recent techniques in adaptive regularization, optimistic gradient predictions, and problem-dependent randomization. We first present a series of new regret guarantees that hold at any time and under very minimal assumptions, and then show how different relaxatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2018
ISSN: 1099-4300
DOI: 10.3390/e20020108